A note on the processor-sharing queue in a quasi-reversible network
نویسندگان
چکیده
منابع مشابه
A note on the event horizon for a processor sharing queue
In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey [5]. If the arrival rate for processor sharing queue has unbounded growth over time, then it is possible for the number of customers in a processor sharing queue to grow so quickly that a ...
متن کاملOn the ASTA property in a feedback processor-sharing queue
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملFluid approximations for a processor-sharing queue
This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...
متن کاملMonotonicity in the limited processor sharing queue
We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...
متن کاملOn a processor sharing queue that models balking
We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others in the system “balks” (i.e., decides not to enter) with probability 1 − bn. If bn is inversely proportional to n + 1, we obtain explicit expressions for a tagged customer’s sojourn time distribution. We consider both the conditional distribution, conditioned on the number of oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1983
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800021297